Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
نویسندگان
چکیده
منابع مشابه
Minimum-Weight Spanning Tree Construction in O(log log n) Communication Rounds
We consider a simple model for overlay networks, where all n processes are connected to all other processes, and each message contains at most O(logn) bits. For this model, we present a distributed algorithm which constructs a minimum-weight spanning tree in O(log logn) communication rounds, where in each round any process can send a message to every other process. If message size is Θ(n ) for ...
متن کاملMinimum-weight Spanning Tree Construction in $O(\log \log \log n)$ Rounds on the Congested Clique
This paper considers the minimum spanning tree (MST) problem in the Congested Clique model and presents an algorithm that runs in O(log log log n) rounds, with high probability. Prior to this, the fastest MST algorithm in this model was a deterministic algorithm due to Lotker et al. (SIAM J on Comp, 2005) from about a decade ago. A key step along the way to designing this MST algorithm is a con...
متن کاملFast Self-Stabilizing Minimum Spanning Tree Construction
We present a novel self-stabilizing algorithm for minimum spanning tree (MST) construction. The space complexity of our solution is O(log n) bits and it converges in O(n) rounds. Thus, this algorithm improves the convergence time of all previously known selfstabilizing asynchronous MST algorithms by a multiplicative factor Θ(n), to the price of increasing the best known space complexity by a fa...
متن کاملWeight-Constrained Minimum Spanning Tree Problem
In an undirected graph G we associate costs and weights to each edge. The weight-constrained minimum spanning tree problem is to find a spanning tree of total edge weight at most a given value W and minimum total costs under this restriction. In this thesis a literature overview on this NP-hard problem, theoretical properties concerning the convex hull and the Lagrangian relaxation are given. W...
متن کاملCommunication - Optimal Parallel Minimum Spanning Tree AlgorithmsExtended
Lower and upper bounds for nding a minimum spanning tree (MST) in a weighted undirected graph on the BSP model are presented. We provide the rst non-trivial lower bounds on the communication volume required to solve the MST problem. Let p denote the number of processors, n the number of nodes of the input graph, and m the number of edges of the input graph. We show that in the worst case a tota...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: SIAM Journal on Computing
سال: 2005
ISSN: 0097-5397,1095-7111
DOI: 10.1137/s0097539704441848